10,054 research outputs found

    Experimental and analytical study of the internal recycle-effect on the heat transfer for the power-law fluid in a double-pass flat-plate heat exchanger with constant wall temperature

    Get PDF
    [[abstract]]A conjugated Graetz problem of the double-pass flat-plate heat exchanger with internal recycle at uniform wall temperature was solved analytically using the orthogonal expansion technique for the power-law fluid. The mathematical formulation was derived for a fully developed laminar flow through the flat-plate channels by ignoring axial conduction and assuming temperature-independent fluid properties. A constant wall temperature, and both the continuous temperature and the same heat flux at the interface of the two adjacent subchannels made by inserting an impermeable sheet in between, were considered as the thermal boundary conditions. Experiments were carried out in order to validate the proposed mathematical formulation and the results can be very satisfactory. It is found that the recycle ratio and the impermeable-sheet position play significant influences on the efficiencies of this double-pass flat-plate heat exchanger. But, if the power consumption is also evaluated, the performance declines for the double-pass heat exchanger with large reflux ratios. The heat-transfer efficiency enhancement for the power-law fluid with a smaller power-law index is found to be less than that with a larger one, however, if both the heat transfer efficiency and the power consumption increment are considered together, the fluid with a smaller index would have a higher performance.[[notice]]補正完畢[[incitationindex]]SCI[[incitationindex]]EI[[booktype]]紙本[[booktype]]電子

    Physical simulation of hot plastic deformation of TiBw/Ti composites

    Get PDF

    Fault-Tolerant Circuit-Switching Networks

    Get PDF
    The authors consider fault-tolerant circuit-switching networks under a random switch failure model. Three circuit-switching networks of theoretical importance—nonblocking networks, rearrangeable networks, and superconcentrators—are studied. The authors prove lower bounds for the size (the number of switches) and depth (the largest number of switches on a communication path) of such fault-tolerant networks and explicitly construct such networks with optimal size Θ( n (log n)2 ) and depth Θ( log n )

    Study of ΛbΛ(ϕ,η())\Lambda_b\to \Lambda (\phi,\eta^{(\prime)}) and ΛbΛK+K\Lambda_b\to \Lambda K^+K^- decays

    Full text link
    We study the charmless two-body ΛbΛ(ϕ,η())\Lambda_b\to \Lambda (\phi,\eta^{(\prime)}) and three-body ΛbΛK+K\Lambda_b\to \Lambda K^+K^- decays. We obtain B(ΛbΛϕ)=(3.53±0.24)×106{\cal B}(\Lambda_b\to \Lambda\phi)=(3.53\pm 0.24)\times 10^{-6} to agree with the recent LHCb measurement. However, we find that B(ΛbΛ(ϕ)K+K)=(1.71±0.12)×106{\cal B}(\Lambda_b\to \Lambda(\phi\to)K^+ K^-)=(1.71\pm 0.12)\times 10^{-6} is unable to explain the LHCb observation of B(ΛbΛK+K)=(15.9±1.2±1.2±2.0)×106{\cal B}(\Lambda_b\to\Lambda K^+ K^-)=(15.9\pm 1.2\pm 1.2\pm 2.0)\times 10^{-6}, which implies the possibility for other contributions, such as that from the resonant ΛbKN,NΛK+\Lambda_b\to K^- N^*,\,N^*\to\Lambda K^+ decay with NN^* as a higher-wave baryon state. For ΛbΛη()\Lambda_b\to \Lambda \eta^{(\prime)}, we show that B(ΛbΛη,Λη)=(1.47±0.35,1.83±0.58)×106{\cal B}(\Lambda_b\to \Lambda\eta,\,\Lambda\eta^\prime)= (1.47\pm 0.35,1.83\pm 0.58)\times 10^{-6}, which are consistent with the current data of (9.35.3+7.3,<3.1)×106(9.3^{+7.3}_{-5.3},<3.1)\times 10^{-6}, respectively. Our results also support the relation of B(ΛbΛη)B(ΛbΛη){\cal B}(\Lambda_b\to \Lambda\eta) \simeq {\cal B}(\Lambda_b\to\Lambda\eta^\prime), given by the previous study.Comment: 8 pages, 1 figure, revised version accepted by EPJ

    Non-leptonic two-body weak decays of Λc(2286)\Lambda_c(2286)

    Full text link
    We study the non-leptonic two-body weak decays of Λc+(2286)BnM\Lambda_c^+(2286)\to {\bf B}_n M with Bn{\bf B}_n (MM) representing as the baryon (meson) states. Based on the SU(3)SU(3) flavor symmetry, we can describe most of the data reexamined by the BESIII Collaboration with higher precisions. However, our result of B(Λc+pπ0)=(5.6±1.5)×104{\cal B}(\Lambda_c^+ \to p\pi^0)=(5.6\pm 1.5)\times 10^{-4} is larger than the current experimental limit of 3×1043\times10^{-4} (90\% C.L.) by BESIII. In addition, we find that B(Λc+Σ+K0)=(8.0±1.6)×104{\cal B}(\Lambda_c^+ \to \Sigma^+ K^0)=(8.0\pm 1.6)\times 10^{-4}, B(Λc+Σ+η)=(1.00.8+1.6)×102{\cal B}(\Lambda_c^+ \to \Sigma^+ \eta^\prime)=(1.0^{+1.6}_{-0.8})\times 10^{-2}, and B(Λc+pη)=(12.28.7+14.3)×104{\cal B}(\Lambda_c^+ \to p \eta^\prime)=(12.2^{+14.3}_{-\,\,\,8.7})\times 10^{-4}, which are accessible to the BESIII experiments.Comment: 12 pages, 1 figure, revised version accepted by PL

    An Integrated Method Based on PSO and EDA for the Max-Cut Problem

    Get PDF
    The max-cut problem is NP-hard combinatorial optimization problem with many real world applications. In this paper, we propose an integrated method based on particle swarm optimization and estimation of distribution algorithm (PSO-EDA) for solving the max-cut problem. The integrated algorithm overcomes the shortcomings of particle swarm optimization and estimation of distribution algorithm. To enhance the performance of the PSO-EDA, a fast local search procedure is applied. In addition, a path relinking procedure is developed to intensify the search. To evaluate the performance of PSO-EDA, extensive experiments were carried out on two sets of benchmark instances with 800 to 20000 vertices from the literature. Computational results and comparisons show that PSO-EDA significantly outperforms the existing PSO-based and EDA-based algorithms for the max-cut problem. Compared with other best performing algorithms, PSO-EDA is able to find very competitive results in terms of solution quality
    corecore